Pii: 0020-7462(70)90054-5
نویسنده
چکیده
The large amplitude steady state forced motion of a simply supported beam with ends restrained to remain a fixed distance apart is represented by a series of linear normal modes. The validity of the assumption of single mode response is examined by investigating the stability of the unforced modes when a single mode is forced. The equations include the effects of an initial axial load and numerical examples are presented for axial loads in both the preand post-buckling regions. It is concluded that the approximation of single mode response is not always valid because of the possible instability of higher modes. NOTATION 6, h length and thickness of beam, respectively m, n, j integers t time v, w displacements in y, z directions, respectively ,v. z coordinates E Young’s modulus i cross section moment of inertia P lateral applied load ey strain component /, mass density Other symbols are defined in the text.
منابع مشابه
The Domatic Number Problem on Some Perfect Graph Families
An extremely simple, linear time algorithm is given for constructing a domatic partition in totally balanced hypergraphs. This simpli es and generalizes previous algorithms for interval and strongly chordal graphs. On the other hand, the domatic number problem is shown to be NP-complete for several families of perfect graphs, including chordal and bipartite graphs.
متن کاملDynamic Program Slicing
A dynamic program slice is an executable subset of the original program that produces the same computations on a subset of selected variables and inputs. It differs from the static slice (Weiser, 1982, 1984) in that it is entirely defined on the basis of a computation. The two main advantages are the following: Arrays and dynamic data structures can be handled more precisely and the size of sli...
متن کاملNonconstructive Advances in Polynomial-Time Complexity
Tim field of computational complexity for concrete, practical combinatorial problems has developed in a remarkably smt~,.th fashi.rt One can point to several t'catures of the theory of polyoowaal-time computability which make it especially well-behaved, including: (1) the modelling of feasible computing by polynomial-time complexity is well-supported by the fact that Mmost all known polynomial-...
متن کامل